Continuous Flattening of Orthogonal Polyhedra
نویسندگان
چکیده
Can we flatten the surface of any 3-dimensional polyhedron P without cutting or stretching? Such continuous flat folding motions are known when P is convex, but the question remains open for nonconvex polyhedra. In this paper, we give a continuous flat folding motion when the polyhedron P is an orthogonal polyhedron, i.e., when every face is orthogonal to a coordinate axis (x, y, or z). More generally, we demonstrate a continuous flat folding motion for any polyhedron whose faces are orthogonal to the z axis or the xy plane.
منابع مشابه
Modelling Decision Problems Via Birkhoff Polyhedra
A compact formulation of the set of tours neither in a graph nor its complement is presented and illustrates a general methodology proposed for constructing polyhedral models of decision problems based upon permutations, projection and lifting techniques. Directed Hamilton tours on n vertex graphs are interpreted as (n-1)- permutations. Sets of extrema of Birkhoff polyhedra are mapped to tours ...
متن کاملGrid Vertex-Unfolding Orthogonal Polyhedra
An edge-unfolding of a polyhedron is produced by cutting along edges and flattening the faces to a net, a connected planar piece with no overlaps. A grid unfolding allows additional cuts along grid edges induced by coordinate planes passing through every vertex. A vertexunfolding permits faces in the net to be connected at single vertices, not necessarily along edges. We show that any orthogona...
متن کاملEpsilon-Unfolding Orthogonal Polyhedra
An unfolding of a polyhedron is produced by cutting the surface and flattening to a single, connected, planar piece without overlap (except possibly at boundary points). It is a long unsolved problem to determine whether every polyhedron may be unfolded. Here we prove, via an algorithm, that every orthogonal polyhedron (one whose faces meet at right angles) of genus zero may be unfolded. Our cu...
متن کاملContinuous Flattening of a Regular Tetrahedron with Explicit Mappings
We use the terminology polyhedron for a closed polyhedral surface which is permitted to touch itself but not self-intersect (and so a doubly covered polygon is a polyhedron). A flat folding of a polyhedron is a folding by creases into a multilayered planar shape ([7], [8]). A. Cauchy [4] in 1813 proved that any convex polyhedron is rigid: precisely, if two convex polyhedra P, P ′ are combinator...
متن کاملSteinitz Theorems for Simple Orthogonal Polyhedra
We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a sphere in which three mutually-perpendicular edges meet at each vertex. By analogy to Steinitz’s theorem characterizing the graphs of convex polyhedra, we find graph-theoretic characterizations of three classes of simple orthogonal polyhedra: corner polyhedra, which can be drawn by isometric pro...
متن کامل